Ultraproducts, p-limits and antichains on the Comfort group order

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ultraproducts and the Group Ring Semiprimitivity Problem

This expository paper is a slightly expanded version of the final talk I gave at the group rings conference celebrating the 25th anniversary of the Institute of Mathematics and Statistics at the University of São Paulo. The talk concerned an application of ultraproducts to the solution of the semiprimitivity problem for group algebras K[G] of locally finite groups G. It explained why the specia...

متن کامل

Ultraproducts of Group Rings

Group Rings Let G = g1, g2, . . . , gn be a finite group, and let k be a field. We define the group ring k[G] to be the set of sums of the form a1g1 + a2g2 + · · ·+ angn with each ai ∈ k and gi ∈ G. Addition is defined componentwise, i.e. (a1g1 + a2g2 + · · ·+ angn) + (b1g1 + b2g2 + · · ·+ bngn) = ((a1 + b1)g1 + (a2 + b2)g2 + · · ·+ (an + bn)gn). We define multiplication in the following way: (...

متن کامل

THE AUTOMORPHISM GROUP OF NON-ABELIAN GROUP OF ORDER p^4

Let G be a finite non-abelian group of order p^4 . In this paper we give a structure theorem for the Sylow p-subgroup, Aut_p(G)  , of the automorphism group of G.

متن کامل

On Finite Maximal Antichains in the Homomorphism Order

The relation of existence of a homomorphism on the class of all relational structures of a fixed type is reflexive and transitive; it is a quasiorder. There are standard ways to transform a quasiorder into a partial order – by identifying equivalent objects, or by choosing a particular representative for each equivalence class. The resulting partial order is identical in both cases. Properties ...

متن کامل

Antichains in the homomorphism order of graphs

Denote by G and D, respectively, the the homomorphism poset of the finite undirected and directed graphs, respectively. A maximal antichain A in a poset P splits if A has a partition (B, C) such that for each p ∈ P either b ≤P p for some b ∈ B or p ≤p c for some c ∈ C. We construct both splitting and non-splitting infinite maximal antichains in G and in D. A point y ∈ P is a cut point in a pose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2004

ISSN: 0166-8641

DOI: 10.1016/j.topol.2004.02.012